| 1. Identity statement | |
| Reference Type | Conference Paper (Conference Proceedings) |
| Site | sibgrapi.sid.inpe.br |
| Holder Code | ibi 8JMKD3MGPEW34M/46T9EHH |
| Identifier | 83LX3pFwXQZW44Lb/d9sky |
| Repository | dpi.inpe.br/ambro/1998/05.14.11.04 |
| Last Update | 1998:06.16.03.00.00 (UTC) administrator |
| Metadata Repository | sid.inpe.br/banon/2001/03.30.15.56.35 |
| Metadata Last Update | 2022:06.14.00.16.55 (UTC) administrator |
| Citation Key | FabrisSilvForr:1997:EfFiAl |
| Title | An efficient filling algorithm for non-simple closed curves using the point containment paradigm  |
| Year | 1997 |
| Access Date | 2024, May 03 |
| Number of Files | 1 |
| Size | 114 KiB |
| 2. Context | |
| Author | 1 Fabris, Antonio Elias 2 Silva, Luciano 3 Forrest, A. Robin |
| Editor | Figueiredo, Luiz Henrique de Netto, Marcio Lobo |
| Conference Name | Brazilian Symposium on Computer Graphics and Image Processing, 10 (SIBGRAPI) |
| Conference Location | Campos de Jordão, SP, Brazil |
| Date | Oct. 1997 |
| Publisher | IEEE Computer Society |
| Publisher City | Los Alamitos |
| Pages | 2-9 |
| Book Title | Proceedings |
| Tertiary Type | Full Paper |
| Organization | SBC - Sociedade Brasileira de Computação; USP - Universidade de São Paulo |
| History (UTC) | 2008-07-17 14:17:58 :: administrator -> banon :: 2008-08-26 15:26:29 :: banon -> administrator :: 2009-08-13 20:36:10 :: administrator -> banon :: 2010-08-28 20:04:52 :: banon -> administrator :: 2022-06-14 00:16:55 :: administrator -> :: 1997 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Version Type | finaldraft |
| Abstract | The Point Containment predicate which specifies if a point is part of a mathematically defined shape or not is one of the most basic notions in raster graphics. This paper presents a technique to counteract the main disadvantage of Point Containment algorithms: their quadratic time complexity with increasing resolution. The implementented algorithm handles complex geometries such as self-intersecting closed curves. |
| Arrangement 1 | urlib.net > SDLA > Fonds > SIBGRAPI 1997 > An efficient filling... |
| Arrangement 2 | urlib.net > SDLA > Fonds > Full Index > An efficient filling... |
| doc Directory Content | access |
| source Directory Content | there are no files |
| agreement Directory Content | there are no files |
| 4. Conditions of access and use | |
| data URL | http://urlib.net/ibi/83LX3pFwXQZW44Lb/d9sky |
| zipped data URL | http://urlib.net/zip/83LX3pFwXQZW44Lb/d9sky |
| Language | en |
| Target File | art17.pdf |
| User Group | administrator |
| Visibility | shown |
| 5. Allied materials | |
| Next Higher Units | 8JMKD3MGPEW34M/46RL7SS 8JMKD3MGPEW34M/4742MCS |
| Citing Item List | sid.inpe.br/sibgrapi/2022/05.08.23.46 6 sid.inpe.br/banon/2001/03.30.15.38.24 1 |
| Host Collection | sid.inpe.br/banon/2001/03.30.15.38 |
| 6. Notes | |
| Notes | The conference was held in Campos de Jordão, SP, Brazil, from October 13 to 16. |
| Empty Fields | affiliation archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage doi e-mailaddress edition electronicmailaddress format group isbn issn keywords label lineage mark mirrorrepository nextedition numberofvolumes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume |